首页> 外文OA文献 >An Efficient Bayesian PAPR Reduction Method for OFDM-Based Massive MIMO Systems
【2h】

An Efficient Bayesian PAPR Reduction Method for OFDM-Based Massive MIMO Systems

机译:一种基于OFDm的大规模mImO的高效贝叶斯papR降低方法   系统

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

We consider the problem of peak-to-average power ratio (PAPR) reduction inorthogonal frequency-division multiplexing (OFDM) based massive multiple-inputmultiple-output (MIMO) downlink systems. Specifically, given a set of symbolvectors to be transmitted to K users, the problem is to find an OFDM-modulatedsignal that has a low PAPR and meanwhile enables multiuser interference (MUI)cancellation. Unlike previous works that tackled the problem using convexoptimization, we take a Bayesian approach and develop an efficient PAPRreduction method by exploiting the redundant degrees-of-freedom of the transmitarray. The sought-after signal is treated as a random vector with ahierarchical truncated Gaussian mixture prior, which has the potential toencourage a low PAPR signal with most of its samples concentrated on theboundaries. A variational expectation-maximization (EM) strategy is developedto obtain estimates of the hyperparameters associated with the prior model,along with the signal. In addition, the generalized approximate message passing(GAMP) is embedded into the variational EM framework, which results in asignificant reduction in computational complexity of the proposed algorithm.Simulation results show our proposed algorithm achieves a substantialperformance improvement over existing methods in terms of both the PAPRreduction and computational complexity.
机译:我们考虑基于正交频分复用(OFDM)的大规模多输入多输出(MIMO)下行链路系统的峰均功率比(PAPR)降低问题。具体而言,给定一组要发送给K个用户的符号向量,问题在于找到具有低PAPR并同时实现多用户干扰(MUI)取消的OFDM调制信号。与以前使用凸优化解决该问题的工作不同,我们采用贝叶斯方法并通过利用发送阵列的冗余自由度来开发一种有效的PAPR降低方法。所寻求的信号在先被视为具有高阶截断的高斯混合的随机矢量,这有可能鼓励低PAPR信号,并且其大部分样本都集中在边界上。开发了变分期望最大化(EM)策略,以获取与信号相关的与先前模型关联的超参数的估计。此外,将广义近似消息传递(GAMP)嵌入变分EM框架中,从而显着降低了该算法的计算复杂度。仿真结果表明,相对于现有方法,我们的算法在这两个方面都取得了实质性的性能提升。 PAPR降低和计算复杂度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号